Plan Quality Optimisation via Block Decomposition
نویسندگان
چکیده
AI planners have to compromise between the speed of the planning process and the quality of the generated plan. Anytime planners try to balance these objectives by finding plans of better quality over time, but current anytime planners often do not make effective use of increasing runtime beyond a certain limit. We present a new method of continuing plan improvement, that works by repeatedly decomposing a given plan into subplans and optimising each subplan locally. The decomposition exploits block-structured plan deordering to identify coherent subplans, which make sense to treat as units. This approach extends the “anytime capability” of current planners – to provide continuing plan quality improvement at any time scale.
منابع مشابه
Continuing Plan Quality Optimisation
Finding high quality plans for large planning problems is hard. Although some current anytime planners are often able to improve plans quickly, they tend to reach a limit at which the plans produced are still very far from the best possible, but these planners fail to find any further improvement, even when given several hours of runtime. We present an approach to continuing plan quality optimi...
متن کاملA Computational Study of Dantzig-Wolfe Decomposition
A Computational Study of Dantzig-Wolfe Decomposition James Richard Tebboth This thesis evaluates the computational merits of the Dantzig-Wolfe decomposition algorithm. We use modern computer hardware and software, and, in particular, we have developed an efficient parallel implementation of Dantzig-Wolfe decomposition. We were able to solve problems of up to 83,500 rows, 83,700 columns, and 622...
متن کاملQuery Optimisation for Web Data Sources: Minimisation of the Number of Accesses
When relational data have access constraints that require certain attributes to be selected in queries, as in the case of (wrapped) Web sources accessible via forms, a recursive query plan is needed to answer queries at best. We present a query plan optimisation technique for several classes of queries that minimises the number of accesses according to a novel, strong notion of minimality. We p...
متن کاملEmergency department resource optimisation for improved performance: a review
Emergency departments (EDs) have been becoming increasingly congested due to the combined impacts of growing demand, access block and increased clinical capability of the EDs. This congestion has known to have adverse impacts on the performance of the healthcare services. Attempts to overcome with this challenge have focussed largely on the demand management and the application of system wide p...
متن کاملThe Recoverable Robust Tail Assignment Problem
Schedule disruptions are commonplace in the airline industry with many flight-delaying events occurring each day. Recently there has been a focus on introducing robustness into airline planning stages to reduce the effect of these disruptions. We propose a recoverable robustness technique as an alternative to robust optimisation to reduce the effect of disruptions and the cost of recovery. We f...
متن کامل